A True Annealing Approach to the Marriage in Honey-Bees Optimization Algorithm

Marriage in Honey Bees Optimization (MBO) is a new swarm intelligence technique inspired by the marriage process of honey bees. It has been shown to be very effective in solving the propositional satisfiability problem known as 3–SAT (each clause has exactly three literals). The objective of this paper is to test a conventional annealing approach as a basis for determining the pool of drones (fathers). This modified MBO algorithm is tested using a group of randomly generated hard 3–SAT problems to compare its behavior and efficiency against previous implementations. We find that the proposed annealing function significantly improved the performance of the committee machine. The improvement is found to be quite dramatic. keywords: Swarm Intelligence, Bees, Propositional Satisfiability